Research of VRP Model with Semi-soft Time Window Constraints
نویسندگان
چکیده
منابع مشابه
Research of VRP Model with Semi-soft Time Window Constraints
Vehicle routing problem is a kind of common problem in logistics distribution center, in order to solve the high delivery cost of VRP and time constraint problem, the VRP model with the object level and constraints by semi-soft time window is built. Aiming to the semi-soft time window constraints the optimization of the model is discussed. Finally the numerical examples prove the superiority of...
متن کاملThe Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
متن کاملA Survey on the Progress of Research on Vehicle Routing Problem with Time Window Constraints
This paper summarizes a survey of literatures based on M. Solomon’s original benchmark problem statement for Vehicle Routing Problem with Time Window Constraint (VRPTW). The survey aims to summarize the progress and evolution of the problem statement as the years go by. We have seen many improvements on the performance of the optimization to the problem from many different algorithms like Genet...
متن کاملGrouping Product Features Using Semi-Supervised Learning with Soft-Constraints
In opinion mining of product reviews, one often wants to produce a summary of opinions based on product features/attributes. However, for the same feature, people can express it with different words and phrases. To produce a meaningful summary, these words and phrases, which are domain synonyms, need to be grouped under the same feature group. This paper proposes a constrained semisupervised le...
متن کاملTwo Time Window Discretization Methods for the Traveling Salesman Problem With Time Window Constraints
In this paper, we discuss the convergence of two time window discretization methods for the traveling salesman problem with time window constraints. These methods are general and can be applied to other vehicle routing and scheduling problems with time windows. The first method provides a feasible solution to the problem while the second provides a lower bound for the minimization problem. Anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2015
ISSN: 1874-110X
DOI: 10.2174/1874110x01509011083